Recursive blocked algorithms for solving triangular systems—Part II
نویسندگان
چکیده
منابع مشابه
Blocked and Recursive Algorithms for Triangular Tridiagonalization
We present partitioned (blocked) algorithms for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithms compute a factorization PAP = LTL where P is a permutation matrix, L is lower triangular with a unit diagonal, and T is symmetric and tridiagonal. The algorithms are based on the column-by-column methods of Parlett and Reid and of Aasen. Our implement...
متن کاملRecursive Blocked Algorithms for Solving Periodic Triangular Sylvester-Type Matrix Equations
Recently, recursive blocked algorithms for solving triangular one-sided and two-sided Sylvester-type equations were introduced by Jonsson and K̊agström. This elegant yet simple technique enables an automatic variable blocking that has the potential of matching the memory hierarchies of today’s HPC systems. The main parts of the computations are performed as level 3 general matrix multiply and ad...
متن کاملBlocked Algorithms for the Reduction to Hessenberg-triangular Form Revisited
We present two variants of Moler and Stewart’s algorithm for reducing a matrix pair to Hessenberg-triangular (HT) form with increased data locality in the access to the matrices. In one of these variants, a careful reorganization and accumulation of Givens rotations enables the use of efficient level 3 BLAS. Experimental results on four different architectures, representative of current high pe...
متن کاملCommunication-Avoiding Parallel Algorithms for Solving Triangular Matrix Equations
In this work an algorithm for solving triangular systems of equations for multiple right hand sides is presented. The algorithm for solving triangular systems for multiple right hand sides, commonly referred to as the TRSM problem, is a very important in dense linear algebra as it is a subroutine for most decompositions of matrices as LU or QR. To improve performance over the standard iterative...
متن کاملTriangular Decomposition Methods for Solving
This paper generalizes to the nonlinear case a standard way to solve general sparse systems of linear equations. In particular, Duu 1977] has suggested that row and column interchanges be applied to permute the coeecient matrix of a linear system into block lower triangular form. The linear system then can be solved by using the associated block Gauss-Seidel or forward block substitution scheme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 2002
ISSN: 0098-3500,1557-7295
DOI: 10.1145/592843.592846